On the Roots of the Substitution Dickson Polynomials
نویسنده
چکیده
Let Fq denote the finite field of order q and characteristic p. For f(x) in Fq[x], let f∗(x,y) denote the substitution polynomial f(x)−f(y). The polynomial f∗(x,y) has frequently been used in questions on the set of values f(x), see for example Wan [8], Dickson [4], Hayes [6], and Gomez-Calderon and Madden [5]. The linear and quadratic factors of f∗(x,y) have been studied by Cohen [2, 3] and also by Acosta and Gomez-Calderon [1]. A factor of f∗(x,y) is said to be a radical factor if it has the form
منابع مشابه
On Classifications of Random Polynomials
Let $ a_0 (omega), a_1 (omega), a_2 (omega), dots, a_n (omega)$ be a sequence of independent random variables defined on a fixed probability space $(Omega, Pr, A)$. There are many known results for the expected number of real zeros of a polynomial $ a_0 (omega) psi_0(x)+ a_1 (omega)psi_1 (x)+, a_2 (omega)psi_2 (x)+...
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کاملDickson Polynomials That Are Permutations
A theorem of S.D. Cohen gives a characterization for Dickson polynomials of the second kind that permutes the elements of a finite field of cardinality the square of the characteristic. Here, a different proof is presented for this result. 1. Permutation polynomials of finite fields. In recent years cryptographers became interested in finding polynomials that induce a bijection of a finite fiel...
متن کاملZeros of Exponential Sums1
1. M. Marden, The geometry of the zeros of a polynomial in a complex variable, Math. Surveys No. 3, Amer. Math. Soc., Providence, R. I., f949. 2. A. Ostrowski, Recherches sur la méthode de Graeffe et les zéros des polynômes et des séries de Laurent, Acta Math. 72 (1940), 99-257. 3. Z. Rubinstein, Analytic methods in the study of zeros of polynomials, Pacific J. Math. 13 (1963), 237-249. 4. W. S...
متن کاملOn the domination polynomials of non P4-free graphs
A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002